Implementation of Hybrid Algorithm for Mobility and Routing Issues in MANET

In this paper, the problem of dynamic multicast routing in mobile ad hoc networks is investigated. Dynamic multicast routing has become a major issue in Manet. Mobile ad hoc networks (MANETs) are collection of wireless mobile nodes, thus connectivity is an issue in this network. Moreover it, the network topology is defined by its routing strategy. In MANET, the network topology keeps changing due to its inherent characteristics such as node mobility. Mobility is the main factor affecting topology changes and route formation. Routing algorithms are responsible for discovering routes between source and destination, in independent mobility environment. Furthermore, this kind of network organization performance is an essential issue. In the previous algorithm [1] the multi-casting tree is improved by using genetic algorithm based high-low mutation genetic algorithm. The proposed algorithm (hybrid algorithm), extension of the previously available algorithm (High low hyper mutation genetic algorithm) is implemented using the network simulator 3 environment. Hybrid algorithm is a mixture of genetic algorithm and K-nearest neighbor algorithm. Then hybrid algorithm compares with traditional algorithm using various performance parameters like throughput, packet delivery ratio, packet drop ratio, end to end delay.